Domain Decomposition and Skeleton Programming with OCamlP3l

نویسندگان

  • François Clément
  • Vincent Martin
  • A. Vodicka
  • Roberto Di Cosmo
  • Pierre Weis
چکیده

c © 2006 by John von Neumann Institute for Computing Permission to make digital or hard copies of portions of this work for personal or classroom use is granted provided that the copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise requires prior specific permission by the publisher mentioned above.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Skeletal Parallel Programming with OCamlP3l 2.0

Parallel programming has proven to be an effective technique to improve the performance of computationally intensive applications. However, writing parallel programs is not easy, and activities such as debugging are usually hard and time consuming. To cope with these difficulties, skeletal parallel programming has been widely explored in recent years with very promising results. However, protot...

متن کامل

Parallel Functional Programming with Skeletons: the ocamlp3l experiment

Writing parallel programs is not easy, and debugging them is usually a nightmare. To cope with these di culties, a structured approach to parallel programs using skeletons and template based compiler techniques has been developed over the past years by several researchers, including the P3L group in Pisa. This approach is based on the use of a set of primitive forms that are just functionals im...

متن کامل

New implementation of a parallel composition primitive for a functionnal BSP language

Bulk-Synchronous Parallel ML (BSML) is a ML based language to code Bulk-Synchronous Parallel (BSP)algorithms. It allows an estimation of execution time, avoids deadlocks and non-determinism. BSML proposes anextension of ML programming with parallel primitives on a parallel data structure called parallel vector. One ofthese primitives is dedicated to express at most divide-and-conque...

متن کامل

Error Free Iterative Morphological Decomposition Algorithm for Shape Representation

Problem statement: A generalized skeleton transform allows a shape to be represented as a collection of modestly overlapped octagonal shape parts. One problem with several generalized Morphological skeleton transforms is that they generate noise after decomposition. The noise rate may not be effective for ordinary images; however this effect will be more when applied on printed or handwritten c...

متن کامل

Updating finite element model using frequency domain decomposition method and bees algorithm

The following study deals with the updating the finite element model of structures using the operational modal analysis. The updating process uses an evolutionary optimization algorithm, namely bees algorithm which applies instinctive behavior of honeybees for finding food sources. To determine the uncertain updated parameters such as geometry and material properties of the structure, local and...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Parallel Computing

دوره 32  شماره 

صفحات  -

تاریخ انتشار 2005